Valuations in Gödel Logic, and the Euler Characteristic

نویسندگان

  • Pietro Codara
  • Ottavio M. D'Antona
  • Vincenzo Marra
چکیده

Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in Gödel logic (over finitely or infinitely many truth-values). We then prove that the information encoded by the Euler characteristic is classical, i.e. coincides with the analogous notion defined over Boolean logic. Building on this, we define many-valued versions of the Euler characteristic of a formula φ, and prove that they indeed provide information about the logical status of φ in Gödel logic. Specifically, our first main result shows that the many-valued Euler characteristics are invariants that separate many-valued tautologies from non-tautologies. Further, we offer an initial investigation of the linear structure of these generalised characteristics. Our second main result is that the collection of many-valued characteristics forms a linearly independent set in the real vector space of all valuations of Gödel logic over finitely many propositional variables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euler Characteristic in Gödel and Nilpotent Minimum Logics

Some decades ago, V. Klee and G.-C.Rota introduced a lattice-theoretic analogue of the Euler characteristic, the celebrated topological invariant of polyhedra. In [1], using the Klee-Rota definition, we introduce the Euler characteristic of a formula in Gödel logic, the extension of intuitionistic logic via the prelinearity axiom. We then prove that the Euler characteristic of a formula over n ...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Non-deterministic Connectives in Propositional Godel Logic

We define the notion of a canonical Gödel system in the framework of single-conclusion hypersequent calculi. A corresponding general (nondeterministic) Gödel valuation semantics is developed, as well as a (non-deterministic) linear intuitionistic Kripke-frames semantics. We show that every canonical Gödel system induces a class of Gödel valuations (and of Kripke frames) for which it is strongly...

متن کامل

Two principles in many-valued logic

Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation, and false according to the other. By a real-valued logic we mean a many-valued logic in the sense of Petr Hájek that is complete with respect to a subalgebra o...

متن کامل

Valuations on Polytopes containing the Origin in their Interiors

We give a classification of non-negative or Borel measurable, SL(d) invariant, homogeneous valuations on the space of d-dimensional convex polytopes containing the origin in their interiors. The only examples are volume, volume of the polar body, and the Euler characteristic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Multiple-Valued Logic and Soft Computing

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012